1930B - Permutation Printing - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define sortdt(v) sort(v.begin(),v.end())
#define sortdt_d(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define ld long double
#define forl(i,k,n) for(long long i=k;i<n;i++)
#define rforl(i,k,n) for(long long i=n-1;i>=k;i--)
#define vll vector <long long>
#define vch vector <char>
#define vpll vector<pair<long long, long long>>
#define printy cout<<"YES"<<endl;
#define printn cout<<"NO"<<endl;
#define takearr(a,n) forl(i,0,n){cin>>a[i];}
#define pb(vec,i) vec.push_back(i)

ll getarrsum(ll arr[], ll n)
{
    ll sum=0;
    forl(i,0,n)
    {
        sum+=arr[i];
    }
    return sum;
}

vll presum(ll arr[], ll n)
{
    vll vec(n);
    vec[0]=arr[0];
    forl(i,1,n)
    {
        vec[i]=arr[i]+vec[i-1];
    }
    return vec;
}

vll sufsum(ll arr[], ll n)
{
    vll vec(n);
    vec[n-1]=arr[n-1];
    rforl(i,0,n-1)
    {
        vec[i]=arr[i]+vec[i+1];
    }
    return vec;
}

void solve()
{
    ll n;
    cin>>n;
    int i=1;
    int j=n;
    while (i<j)
    {
        cout<<i<<" "<<j<<" ";
        i++;
        j--;
    }
    if (i==j)
    {
        cout<<i<<" ";
    }
    cout<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    ll t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}